#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;
const int N = 1e5 + 10;

LL n, k, b, s;
LL d[N];


int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--){
        cin >> n >> k >> b >> s;
        for(int i = 1; i <= n; i ++){
            if(i != n){
                d[i] = 0;
            }else{
                d[i] = b;
            }
        }

        LL sum = 0;
        for(int i = 1; i <= n; i ++){
            d[i] = (LL)k * d[i];
            sum = sum + d[i];
        }

        sum = s - sum;

        if(sum < 0){
            cout << -1 << '\n';
            continue;
        }
        for(int i = 1; i <= n; i ++){
            if(sum == 0) break;
            if(sum >= k - 1){
                d[i] += k - 1;
                sum -= k - 1;
            }else{
                d[i] += sum;
                sum -= sum;
            }
        }

        if(sum > 0){
            cout << -1 << '\n';
            continue;
        }

        for(int i = 1; i <= n; i ++){
            cout << d[i] << " ";
        }
        cout << '\n';

        
    }


    return 0;
}  